Acyclic orientation graph coloring for software-managed memory allocation

Graph-Coloring Register Allocation for Irregular Architectures

The graph-coloring metaphor leads to elegant algorithms for register allocation that have been shown to be quite effective for regular architectures with plenty of registers. Published attempts to make these algorithms applicable to architectures that are irregular in their use of registers have yielded several incompatible extensions that handle only a small subset of the irregularities seen i...

dynamic coloring of graph

در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...

Register Allocation via Hierarchical Graph Coloring

Register allocation is a vital stage in compiler optimization. It greatly impacts the effectiveness of other compiler optimization techniques. Graph coloring is the commonly used mechanism for register allocation. Since graph coloring is an NP-complete problem, heuristics are needed to find a practical solution. Several heuristics are available that perform well in practice. Commonly used heuri...

Register Allocation by Graph Coloring: A Review

Approaches to Enhance Graph Coloring Register Allocation

The relationship between run-time performance and effective use of a machine’s register set is well understood. Graph coloring method, which pioneered by Chaitin, has been widely practiced. In this paper, we describe three improvements to Chaitin-style graph coloring register allocators. The first is a more precise definition on interference. The second is called rename, which can be easily inc...